Amdahl's and Gustafson-Barsis laws revisited
نویسنده
چکیده
The paper presents a simple derivation of the Gustafson-Barsis law from the Amdahl's law. In the computer literature these two laws describing the speedup limits of parallel applications are derived separately. It is shown, that treating the time of the execution of the sequential part of the application as a constant, in few lines the Gustafson-Barsis law can be obtained from the Amdahl's law and that the popular claim, that Gustafson-Barsis law overthrows Amdahl's law is a mistake.
منابع مشابه
A Parallel Software Communication Model and Metrics
In this paper, we adapt Gustafson-Barsis' law to evaluate the eeect of communication on the performance of parallel programs. We also deene some communication metrics to gain insight into the diierent aspects of communication for the purpose of understanding , controlling, and predicting the cost of communication in parallel programs. Matrix algorithms are provided to show how these metrics are...
متن کاملGetting in the Zone for Successful Scalability
The universal scalability law (USL) is an analytic model used to quantify application scaling. It is universal because it subsumes Amdahl’s law and Gustafson linearized scaling as special cases. Using simulation, we show: (i) that the USL is equivalent to synchronous queueing in a load-dependent machine repairman model and (ii) how USL, Amdahl’s law and Gustafson scaling can be regarded as boun...
متن کاملThe Consequences of Fixed Time Performance Measurement*
In measuring performance of parallel computers, the usual method is to choose a problem and test execution time as the processor count is varied. This model underlies definitions of “speedup,” “efficiency,” and arguments against parallel processing such as Ware’s formulation of Amdahl’s law. Fixed time models use problem size as the figure of merit. Analysis and experiments based on fixed time ...
متن کاملA General Theory of Computational Scalability Based on Rational Functions
The universal scalability law (USL) of computational capacity is a rational function Cp = P (p)/Q(p) with P (p) a linear polynomial and Q(p) a second-degree polynomial in the number of physical processors p, that has been long used for statistical modeling and prediction of computer system performance. We prove that Cp is equivalent to the synchronous throughput bound for a machine-repairman wi...
متن کاملAnalytical Modeling of Parallel Programs
A parallel program should be evaluated to determine its efficiency, accuracy and benefits. This paper defines how parallel programs differ by sequential programs. A brief discussion on the effect of increasing number of processors on execution time is given. Some of the important measurement units which are used for the purpose of measuring performance of a parallel program are discussed. Vario...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0809.1177 شماره
صفحات -
تاریخ انتشار 2008